Some Convergence Estimates For Algebraic Multilevel Preconditioners
نویسندگان
چکیده
We discuss the construction of algebraic multilevel preconditioners for the conjugate gradient method and derive explicit and sharp bounds for the convergence rates. We present several numerical examples that demonstrate the efficiency of the preconditioner. sparse approximate inverse, sparse matrix, algebraic multilevel method, preconditioning, conjugate gradient method, Krylov subspace method Primary 65F05; Secondary 65F10, 65F50, 65Y05
منابع مشابه
Algebraic Multilevel Preconditioners for the Graph Laplacian Based on Matching in Graphs
This paper presents estimates of the convergence rate and complexity of an algebraic multilevel preconditioner based on piecewise constant coarse vector spaces applied to the graph Laplacian. A bound is derived on the energy norm of the projection operator onto any piecewise constant vector space, which results in an estimate of the two-level convergence rate where the coarse level graph is obt...
متن کاملParallel algebraic multilevel Schwarz preconditioners for a class of elliptic PDE systems
Algebraic multilevel preconditioners for algebraic problems arising from the discretization of a class of systems of coupled elliptic partial differential equations (PDEs) are presented. These preconditioners are based on modifications of Schwarz methods and of the smoothed aggregation technique, where the coarsening strategy and the restriction and prolongation operators are defined using a po...
متن کاملParallel algebraic multilevel Schwarz preconditioners for elliptic PDE systems∗
Algebraic multilevel preconditioners for linear systems arising from the discretization of a class of systems of coupled elliptic partial differential equations (PDEs) are presented. These preconditioners are based on modifications of Schwarz methods and of the smoothed aggregation technique, where the coarsening strategy and the restriction and prolongation operators are defined using a point-...
متن کاملAn Algebraic Approach for H-matrix Preconditioners∗
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebraic approach to constructing H-matrices which combines multilevel clustering methods with the H-matrix arithmetic to compute the H-inverse, H-LU, and the H-Cholesky factors of a matrix. Then the H-inverse, H-LU or H-Chol...
متن کاملA new approach to algebraic multilevel methods based on sparse approximate inverses
In this paper we introduce a new approach to algebraic multilevel methods and their use as preconditioners in iterative methods for the solution of symmetric positive definite linear systems. The multilevel process and in particular the coarsening process is based on the construction of sparse approximate inverses and their augmentation with corrections of smaller size. We present comparisons o...
متن کامل